Translating Higher-Order Modal Logic from RuleML to TPTP
نویسندگان
چکیده
This paper discusses extensions of RuleML and TPTP for higher-order logic, modal logic, and higher-order modal logic. For these extensions, an extended XSLT 2.0-based translator is presented which maps from RuleML/XML to TPTP. With this implemented HOML RuleM2TPTP tool, TPTP can benefit from RuleML interoperation and much of Deliberation RuleML can execute on TPTP-aware provers.
منابع مشابه
PSOATransRun: Translating and Running PSOA RuleML via the TPTP Interchange Language for Theorem Provers
PSOA RuleML is an object-relational rule language generalizing POSL, OO RuleML, F-logic, and RIF-BLD. In PSOA RuleML, the notion of positional-slotted, object-applicative (psoa) terms is used as a generalization of: (1) positional-slotted terms in POSL and OO RuleML and (2) frame and class-membership terms in F-logic and RIF-BLD. We demonstrate an online PSOA RuleML reasoning service, PSOATrans...
متن کاملPSOA2TPTP: A Reference Translator for Interoperating PSOA RuleML with TPTP Reasoners
PSOA RuleML is a recently specified rule language combining relational and object-oriented modeling. In order to provide reasoning services for PSOA RuleML, we have implemented a reference translator, PSOA2TPTP, to map knowledge bases and queries in the PSOA RuleML presentation syntax (PSOA/PS) to the popular TPTP format, supported by many first-order logic reasoners. In particular, PSOA RuleML...
متن کاملThe RuleML Knowledge-Interoperation Hub
The RuleML knowledge-interoperation hub provides for syntactic/semantic representation and internal/external transformation of formal knowledge. The representation system permits the configuration of textbook and enriched Relax NG syntax as well as the association of syntax with semantics. The transformation tool suite includes serialized formatters (normalizers and compactifiers), polarized pa...
متن کاملThe Higher-Order Prover Leo-III
The automated theorem prover Leo-III for classical higherorder logic with Henkin semantics and choice is presented. Leo-III is based on extensional higher-order paramodulation and accepts every common TPTP dialect (FOF, TFF, THF), including their recent extensions to rank-1 polymorphism (TF1, TH1). In addition, the prover natively supports almost every normal higher-order modal logic. Leo-III c...
متن کاملBuilding a Problem Library for First-Order Modal Logics
First-order modal logics have many applications, e.g. in planning and program verification. Whereas comprehensive and standardized problem libraries exist for, e.g., classical (TPTP library) and intuitionistic (ILTP library) logic, nothing comparable is so far available for firstorder modal logics. The aim of the Quantified Modal Logic Theorem Proving (QMLTP) library is to close this gap by pro...
متن کامل